Bicrossed products with the Taft algebra
نویسندگان
چکیده
منابع مشابه
Bicrossed Products for Finite Groups
We investigate one question regarding bicrossed products of finite groups which we believe has the potential of being approachable for other classes of algebraic objects (algebras, Hopf algebras). The problem is to classify the groups that can be written as bicrossed products between groups of fixed isomorphism types. The groups obtained as bicrossed products of two finite cyclic groups, one be...
متن کاملStructure of Certain Banach Algebra Products
Let and be Banach algebras, , and . We define an -product on which is a strongly splitting extension of by . We show that these products form a large class of Banach algebras which contains all module extensions and triangular Banach algebras. Then we consider spectrum, Arens regularity, amenability and weak amenability of these products.
متن کاملScheduling Transient Overload with the TAFT Scheduler
Nearly all known real-time scheduling approaches rely on the knowledge of Worst Case Execution Times (WCETs) for all tasks of the system. This is a severe restriction, as with today’s complex systems it becomes increasingly more expensive to determine WCET by applying analytical methods and the computed results often turn out to be a very pessimistic upper bound for the observed execution time....
متن کاملBicrossed Products, Matched Pair Deformations and the Factorization Index for Lie Algebras
For a perfect Lie algebra h we classify all Lie algebras containing h as a subalgebra of codimension 1. The automorphism groups of such Lie algebras are fully determined as subgroups of the semidirect product h n (k∗ × AutLie(h)). In the non-perfect case the classification of these Lie algebras is a difficult task. Let l(2n + 1, k) be the Lie algebra with the bracket [Ei, G] = Ei, [G,Fi] = Fi, ...
متن کاملKleene Algebra with Products and Iteration Theories
We develop a typed equational system that subsumes both iteration theories and typed Kleene algebra in a common framework. Our approach is based on cartesian categories endowed with commutative strong monads to handle nondeterminism. 1998 ACM Subject Classification F.3.1 Specifying and Verifying and Reasoning about Programs
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archiv der Mathematik
سال: 2019
ISSN: 0003-889X,1420-8938
DOI: 10.1007/s00013-019-01328-3